Coloring graphs with no induced five‐vertex path or gem
نویسندگان
چکیده
منابع مشابه
Graphs with no induced five-vertex path or antipath
We prove that a graph G contains no induced 5-vertex path and no induced complement of a 5-vertex path if and only if G is obtained from 5-cycles and split graphs by repeatedly applying the following operations: substitution, split unification, and split unification in the complement, where split unification is a new class-preserving operation introduced here. ∗Princeton University, Princeton, ...
متن کاملThree-coloring graphs with no induced seven-vertex path I : the triangle-free case
In this paper, we give a polynomial time algorithm which determines if a given triangle-free graph with no induced seven-vertex path is 3-colorable, and gives an explicit coloring if one exists.
متن کاملThree-coloring graphs with no induced seven-vertex path II : using a triangle
In this paper we give a polynomial time algorithm which determines if a given graph containing a triangle and no induced seven-vertex path is 3-colorable, and gives an explicit coloring if one exists. This is the second paper in a series of two. The first one, [3] is also submitted to this journal. In [2, 3], a polynomial time algorithm is given for three-coloring triangle-free graphs with no i...
متن کامل4-coloring $P_6$-free graphs with no induced 5-cycles
We show that the 4-coloring problem can be solved in polynomial time for graphs with no induced 5-cycle C5 and no induced 6-vertex path P6.
متن کاملGraphs with no induced wheel or antiwheel
A wheel is a graph that consists of a chordless cycle of length at least 4 plus a vertex with at least three neighbors on the cycle. It was shown recently that detecting induced wheels is an NP-complete problem. In contrast, it is shown here that graphs that contain no wheel and no antiwheel have a very simple structure and consequently can be recognized in polynomial time. Four families of gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2020
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22572